Abductive Reasoning for Burden of Proof
نویسندگان
چکیده
In argumentation system, it is important to reason about winning strategy during argument according to the context of their counterpart arguments and their own past arguments. In legal reasoning, it is more complicated than the ordinary argumentation system, since it involves a notion of a burden of proof. In this paper, we extend our framework to reason about the next move given context of arguments in legal reasoning by introducing an abductive framework into our previous work [7] of a formalization of burden of proof. We show that an abductive framework is useful for reasoning about the next suitable measure in order to win a case.
منابع مشابه
Burdens and Standards of Proof for Inference to the Best Explanation
In this paper, we provide a formal logical account of the burden of proof and proof standards in legal reasoning. As opposed to the usual argument-based model we use a hybrid model for Inference to the Best Explanation, which uses stories or explanations as well as arguments. We use examples of real cases to show that our hybrid reasoning model allows for a natural modeling of burdens and stand...
متن کاملThe CIFF Proof Procedure: Definition and Soundness Results
We introduce a new proof procedure for abductive logic programming and prove two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate correctly. An implementation of our proof procedure is available and has been applied successfully in t...
متن کاملAn Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure
While it is well-known how normal logic programs may be viewed as a form of abduction and argumentation, the problem of how disjunctive programs may be used for abductive reasoning is rarely discussed. In this paper we propose an abductive semantics for disjunctive logic programs with default negation and show that Eshghi and Kowal-ski's abductive proof procedure for normal programs can be adop...
متن کاملVerifiable Agent Interaction in Abductive Logic Programming: the SCIFF proof-procedure
SCIFF is a new abductive logic programming proof-procedure for reasoning with expectations in dynamic environments. SCIFF is also the main component of a framework thought to specify and verify interaction in open agent societies. In this paper we present the declarative and operational semantics of SCIFF, its termination, soundness and completeness results, and some sample applications to demo...
متن کاملIntegration of Abductive Reasoning and Constraint Optimization in SCIFF
Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP constraints. These two frameworks have been merged in works by various authors, who developed efficient abductive proof-procedures empowered with constraint satisfaction techniques. However, while almost all CLP languages provide...
متن کامل